Complexity of Uniform Membership of Context-Free Tree Grammars
نویسنده
چکیده
We show that the uniform membership problem of context-free tree grammars is PSPACE-complete. The proof of the upper bound is by construction of an equivalent pushdown tree automaton representable in polynomial space. With this technique, we can also give an alternative proof that the respective nonuniform membership problem is in NP. A corollary for uniform membership of "-free indexed grammars is obtained.
منابع مشابه
The complexity of tree automata and XPath on grammar-compressed trees
The complexity of various membership problems for tree automata on compressed trees is analyzed. Two compressed representations are considered: dags, which allow to share identical subtrees in a tree, and straight-line context-free tree grammars, which moreover allow to share identical intermediate parts in a tree. Several completeness results for the classes NL, P, and PSPACE are obtained. Fin...
متن کاملTree Automata and XPath on Compressed Trees
The complexity of various membership problems for tree automata on compressed trees is analyzed. Two compressed representations are considered: dags, which allow to share identical subtrees in a tree, and straight-line contextfree tree grammars, which moreover allow to share identical intermediate parts of a tree. Several completeness results for the classes NL, P, and PSPACE are obtained. Fina...
متن کاملStudying impressive parameters on the performance of Persian probabilistic context free grammar parser
In linguistics, a tree bank is a parsed text corpus that annotates syntactic or semantic sentence structure. The exploitation of tree bank data has been important ever since the first large-scale tree bank, The Penn Treebank, was published. However, although originating in computational linguistics, the value of tree bank is becoming more widely appreciated in linguistics research as a whole. F...
متن کاملA note on the complexity of deterministic tree-walking transducers
The deterministic tree-walking transducer is one of a number of possible formalisms for defining mildly context-sensitive languages. It is well known that the non-uniform membership problem for languages that can be defined in this formalism is solvable in polynomial time. The uniform membership problem, where both the transducer and the word in question are considered part of the input, is les...
متن کاملOn the Computational Complexity of Synchronized Context-Free Languages
We introduce counter synchronized context-free grammars and investigate their generative power. It turns out that the family of counter synchronized context-free languages is a proper superset of the family of context-free languages and is strictly contained in the family of synchronized context-free languages. Moreover, we establish the space and time complexity of the fixed membership, the ge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015